Efficient systolic solution for a new prime factor discrete Hartley transform algorithm - Circuits, Devices and Systems, IEE Proceedings G

Recently, a novel systolic structure has been proposed for the computation of DFT for transform length N = 4 M , M being prime to 4. In this paper, we have proposed a similar structure for the computation of DHT by prime factor decomposition. A new recursive algorithm is also proposed for computing DHT using a linear systolic array of cordic processing elements. The proposed structure has nearly the same hardware requirement as that of the corresponding DFT structure for real-valued data; but it yields significantly higher throughput, prime factor decomposition used in this paper is different from that used in Reference 4. A new recursive algorithm is also proposed for efficient computation of the DHT by a linear systolic array of cordic processing elements (PE). It is shown that the proposed structure has nearly the same hardware requirement as the corresponding DFT structure [ 5 ] for real-valued data; but it yields significantly higher throughput. 2 The recursive DHT algorithm and its systolic solution The DHT defined by eqn. 1 may be expressed as I I ( N 1 ) / 2 " = l X ( k ) = x(0) + 1 [Re Pt {z(n)a"} + Im Pt {z(n)a'""}]